| 2012 | Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky: Solving the canonical representation and Star System problems for proper circular-arc graphs in Logspace. In: Deepak D'Souza, Telikepalli Kavitha, Jaikumar Radhakrishnan, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012).
Leibniz International Proceedings in Informatics, Vol. 18. Schloss Dagstuhl,
Leibniz-Zentrum für Informatik, 2012. 387-399 |
|---|
| 2011 | Johannes Köbler, Sebastian Kuhnert, Bastian Laubner, Oleg Verbitsky: Interval graphs: canonical representation in Logspace.. In: SIAM Journal on Computing, 2011, 1292-1315 |
|---|
| 2011 | Oleg Pikhurko, Oleg Verbitsky: Logical complexity of graphs: a survey.. In: Janos Makowsky, Martin Grohe, Model Theoretic Methods in Finite Combinatorics,
Contemporary Mathematics, Vol. 558.. American Mathematical Society, 2011. 129-179 |
|---|
| 2011 | Alexander Ravsky, Oleg Verbitsky: On collinear sets in straight line drawings. In: Petr Kolman, Jan Kratochvil, Graph-Theoretic Concepts in Computer Science,
Lecture Notes in Computer Science, Vol. 6986. Springer, 2011. 295-306 |
|---|
| 2011 | Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Mathias Schacht, Oleg Verbitsky: Untangling planar graphs from a specified vertex position - Hard cases. In: Discrete Applied Mathematics, 2011, 789-799 |
|---|
| 2010 | Taras Banakh, Oleg Verbitsky, Yaroslav Vorobets: Fermat's spiral and the line between Yin and Yang. In: American Mathematical Monthly, 2010, 786-800 |
|---|
| 2010 | Johannes Köbler, Sebastian Kuhnert, Bastian Laubner, Oleg Verbitsky: Interval graphs: canonical representation in Logspace. In: Samson Abramsky et al., Proc. of the 37th International Colloquium on Automata, Languages and Programming, vol. 6198 of Lecture Notes in Computer Science.. Springer, 2010. 384-395 |
|---|
| 2008 | Johannes Köbler, Oleg Verbitsky: From invariants to canonization in parallel. In: E.A. Hirsch et al., Lecture Notes in Computer Science, Vol. 5010. Springer Verlag, 2008. 216-227 |
|---|
| 2008 | Oleg Verbitsky: On the obfuscation complexity of planar graphs. In: Theoretical Computer Science, 2008, 294-300 |
|---|
| 2007 | Oleg Pikhurko, Joel Spencer, Oleg Verbitsky: Decomposable graphs and definitions with no quantifier alternation.. In: European Journal of Combinatorics, 2007, 2264-2283 |
|---|
| 2007 | Tom Bohman, Alan Frieze, Tomasz Luczak, Oleg Pikhurko, Clifford Smyth, Joel Spencer, Oleg Verbitsky: First order definability of trees and sparse random graphs.. In: Combinatorics, Probability and Computing, 2007, 375-400 |
|---|
| 2007 | Oleg Verbitsky, M. Kang, M. Schacht: How much work does it take to straighten a plane graph out?. In: arxiv.org/abs/0707.3373, 2007, 1-3 |
|---|
| 2007 | Frank Harary, Wolfgang Slany, Oleg Verbitsky: On the computational complexity of the forcing chromatic number.. In: SIAM Journal on Computing, 2007, 1-19 |
|---|
| 2007 | Oleg Verbitsky: Planar graphs: logical complexity and parallel isomorphism tests.. In: Wolfgang Thomas, Pascal Weil., STACS 2007. Lecture Notes in Computer Science, Vol. 4393.. Springer-Verlag, 2007. 682-693 |
|---|
| 2006 | M. Grohe, Oleg Verbitsky: Testing graph isomorphism in parallel by playing a game. In: Lecture Notes in Computer Science, 2006, 3-14 |
|---|
| 2005 | Oleg Pikhurko, Joel Spencer, Oleg Verbitsky: Decomposable graphs and
definitions with no quantifier alternation.. In: Discrete Mathematics and Theoretical Computer Science, 2005, 25-30 |
|---|
| 2005 | Frank Harary, Wolfgang Slany, Oleg Verbitsky: On the computational complexity of the forcing chromatic number. In: Volker Diekert, Bruno Durand STACS 2005 (22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany,
February 2005, Proceedings)
Lecture Notes in Computer Science, Volume 3404. Springer-Verlag, 2005. 182-193 |
|---|
